Enumerating all maximal biclusters in numerical datasets
نویسندگان
چکیده
منابع مشابه
Enumerating all maximal biclusters in numerical datasets
Biclustering has proved to be a powerful data analysis technique due to its wide success in various application domains. However, the existing literature presents efficient solutions only for enumerating maximal biclusters with constant values, or heuristic-based approaches which can not find all biclusters or even support the maximality of the obtained biclusters. Here, we present a general fa...
متن کاملEnumerating All Maximal Frequent Subtrees
Given a collection of leaf-labeled trees on a common leafset and a fraction f in (1/2,1], a frequent subtree (FST) is a subtree isomorphically included in at least fraction f of the input trees. The well-known maximum agreement subtree (MAST) problem identifies FST with f = 1 and having the largest number of leaves. Apart from its intrinsic interest from the algorithmic perspective, MAST has pr...
متن کاملEfficient mining of maximal biclusters in mixed-attribute datasets
This paper presents a novel enumerative biclustering algorithm to directly mine all maximal biclusters in mixed-attribute datasets, with or without missing values. The independent attributes are mixed or heterogeneous, in the sense that both numerical (real or integer values) and categorical (ordinal or nominal values) attribute types may appear together in the same dataset. The proposal is an ...
متن کاملEfficiently enumerating all maximal cliques with bit-parallelism
The maximal clique enumeration (MCE) problem has numerous applications in biology, chemistry, sociology, and graph modeling. Though this problem is well studied, most current research focuses on finding solutions in large sparse graphs or very dense graphs, while sacrificing efficiency on the most difficult medium-density benchmark instances that are representative of data sets often encountere...
متن کاملAlgorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs
For a bipartite graph G = (V, E), (1) perfect, (2) maximum and (3) maximal matchings are matchings (1) such that all vertices are incident to some matching edges, (2) whose cardinalities are maximum among all matchings, (3) which are contained in no other matching. In this paper, we present three algorithms for enumerating these three types of matchings. Their time complexities are O(|V |) per ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2017
ISSN: 0020-0255
DOI: 10.1016/j.ins.2016.10.029